Effective partitioning method for computing weighted Moore-Penrose inverse
نویسندگان
چکیده
We introduce a method and algorithm for computing the weighted MoorePenrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [24] to multiple variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Also, these methods are generalizations of the partitioning method for computing the Moore-Penrose inverse of rational and polynomial matrices introduced in [22] and [23] to the case of weighted MoorePenrose inverse. Algorithms are implemented in the symbolic computational package MATHEMATICA. AMS Subj. Class.: 15A09, 68Q40.
منابع مشابه
Symbolic computation of weighted Moore-Penrose inverse using partitioning method
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial matrix. These methods and algorithms are generalizations of the method or computing the weighted Moore-Penrose inverse for constant matrices, originated in [2...
متن کاملSymbolic computation of the Moore-Penrose inverse using a partitioning method
We propose an extension of the Grevile’s partitioning method for computing the Moore-Penrose inverse of two-variable rational and polynomial complex matrices. Also we developed corresponding effective algorithm, applicable in the case when there are only few degrees in A(s1, s2) corresponding to nonzero coefficient matrices. These algorithms are implemented using symbolic and functional possibi...
متن کاملAn accelerated iterative method for computing weighted Moore-Penrose inverse
The goal of this paper is to present an accelerated iterative method for computing weighted Moore–Penrose inverse. Analysis of convergence is included to show that the proposed scheme has sixth-order convergence. Using a proper initial matrix, a sequence of iterates will be produced, which is convergent to the weighted Moore–Penrose inverse. Numerical experiments are reported to show the effici...
متن کاملAn Efficient Schulz-type Method to Compute the Moore-Penrose Inverse
A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.
متن کاملAbout the generalized LM-inverse and the weighted Moore-Penrose inverse
The recursive method for computing the generalized LM inverse of a constant rectangular matrix augmented by a column vector is proposed in [16, 17]. The corresponding algorithm for the sequential determination of the generalized LM -inverse is established in the present paper. We prove that the introduced algorithm for computing the generalized LM inverse and the algorithm for the computation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 55 شماره
صفحات -
تاریخ انتشار 2008